Algebraic reduction for the Golden Code

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Algebraic Matching of Vulnerabilities in a Low-Level Code

This paper explores the algebraic matching approach for detection of vulnerabilities in binary codes. The algebraic programming system is used for implementing this method. It is anticipated that models of vulnerabilities and programs to be verified are presented as behavior algebra and action language specifications. The methods of algebraic matching are based on rewriting rules and techniques...

متن کامل

Patterns for In-code Algebraic Testing

This paper describes an in-code approach to automatic algebraic-based software testing and a number of useful design patterns for doing it. The approach uses algebras as testable views on a system. These views form test interfaces which are highly automatable. Specifications are expressed in terms of axioms of the algebras. We use the testing tool T2 to provide automation. T2 works with in-code...

متن کامل

Algebraic Evolution of the Genetic Code

The evolution of the genetic code has been speculated by many authors, but all of them lack determinative proofs. Jukes [4] inferred the evolution from mitochondrial codes, which are different from the universal codes in some respects. He postulated an archetypal code containing 14 amino acids, from which the universal code could evolve by gene duplication followed by mutational changes. This p...

متن کامل

Reduction methods for quasilinear differential-algebraic equations

Geometric reduction methods for differential-algebraic equations (DAEs) aim at an iterative reduction of the problem to an explicit ODE on a lower-dimensional submanifold of the so-called semistate space. This approach usually relies on certain algebraic (typically constant-rank) conditions holding at every reduction step. When these conditions are met the DAE is called regular. We discuss in t...

متن کامل

A Reduction Algorithm for Algebraic Function Fields

Computer algebra systems often produce large expressions involving complicated algebraic numbers. In this paper we study variations of the polred algorithm that can often be used to find better representations for algebraic numbers. The main new algorithm presented here is an algorithm that treats the same problem for the function field case.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Advances in Mathematics of Communications

سال: 2012

ISSN: 1930-5346

DOI: 10.3934/amc.2012.6.1